Revisiting Generic Bases of Association Rules
نویسندگان
چکیده
As a side effect of unprecedented amount of digitization of data, classical retrieval tools found themselves unable to go further beyond the tip of the Iceberg. Data Mining in conjunction with the Formal Concept Analysis, is a clear promise to furnish adequate tools to do so and specially to be able to derive concise generic and easy understandable bases of ”hidden” knowledge, that can be reliable in a decision making process. In this paper, we propose to revisit the notion of association rule redundancy and to present sound inference axioms for deriving all association rules from generic bases of association rules.
منابع مشابه
Generic Association Rule Bases: Are They so Succinct?
In knowledge mining, current trend is witnessing the emergence of a growing number of works towards defining “concise and lossless” representations. One main motivation behind is: tagging a unified framework for drastically reducing large sized sets of association rules. In this context, generic bases of association rules – whose backbone is the conjunction of the concepts of minimal generator ...
متن کاملPrince: An Algorithm for Generating Rule Bases Without Closure Computations
The problem of the relevance and the usefulness of extracted association rules is becoming of primary importance, since an overwhelming number of association rules may be derived, even from reasonably sized databases. To overcome such drawback, the extraction of reduced size generic bases of association rules seems to be promising. Using the concept of minimal generator, we propose an algorithm...
متن کاملPRINCE: Extraction optimisée des bases génériques de règles sans calcul de fermetures
The problem of the relevance and the usefulness of extracted association rules is becoming of primary importance, since an overwhelming number of association rules may be derived even from reasonably sized databases. This requires the extraction of generic bases of association rules, of reduced size and which summarize the same information. Using the concept of minimal generator, we propose an ...
متن کاملAvoiding the itemset closure computation ”pitfall”
Extracting generic bases of association rules seems to be a promising issue in order to present informative and compact user addedvalue knowledge. However, extracting generic bases requires partially ordering costly computed itemset closures. To avoid the nightmarish itemset closure computation cost, specially for sparse contexts, we introduce an algorithm, called Prince, allowing an astute ext...
متن کاملA new generic basis of "factual" and "implicative" association rules
The extremely large number of association rules that can be drawn from – even reasonably sized datasets, bootstrapped the development of more acute techniques or methods to reduce the size of the reported rule sets. In this context, the battery of results provided by the Formal Concept Analysis (FCA) allowed one to define “irreducible” nuclei of association rule subset better known as generic b...
متن کامل